Dynamic Index and LZ Factorization in Compressed Space
نویسندگان
چکیده
In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T , where w = O(min(z logN log M,N)) is the size of the signature encoding of T , z is the size of the Lempel-Ziv77 (LZ77) factorization of T , N is the length of T , and M ≥ 3N is an integer that can be handled in constant time under word RAM model. Our index supports searching for a pattern P in T in O(|P |fA + logw log |P | log ∗ M(logN + log |P | log M) + occ logN) time and insertion/deletion of a substring of length y in O((y + logN log M) logw logN log M) time, where fA = O(min{ log logM log logw log log logM , √ logw log logw }). Also, we propose a new space-efficient LZ77 factorization algorithm for a given text of length N , which runs in O(NfA + z logw log 3 N(log N)) time with O(w) working space.
منابع مشابه
Dynamic index, LZ factorization, and LCE queries in compressed space
In this paper, we present the following results: (1) We propose a new dynamic compressed index of O(w) space, that supports searching for a pattern P in the current text in O(|P | logw+logw log |P | logN(log M)+occ logN) time and insertion/deletion of a substring of length y in O((y + logN log M) logw logN log M) time, where N is the length of the current text, M is the maximum length of the dy...
متن کاملSpace-efficient construction of Lempel-Ziv compressed text indexes
A compressed full-text self-index is a data structure that replaces a text and in addition gives indexed access to it, while taking space proportional to the compressed text size. This is very important nowadays, since one can accommodate the index of very large texts entirely in main memory, avoiding the slower access to secondary storage. In particular, the LZ-index [G. Navarro, Journal of Di...
متن کاملSpace-Efficient Construction of LZ-Index
A compressed full-text self-index is a data structure that replaces a text and in addition gives indexed access to it, while taking space proportional to the compressed text size. The LZ-index, in particular, requires 4uHk(1 + o(1)) bits of space, where u is the text length in characters and Hk is its k-th order empirical entropy. Although in practice the LZ-index needs 1.0-1.5 times the text s...
متن کاملCompressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
The dynamic trie is a fundamental data structure which finds applications in many areas. This paper proposes a compressed version of the dynamic trie data structure. Our data-structure is not only space efficient, it also allows pattern searching in o(|P |) time and leaf insertion/deletion in o(log n) time, where |P | is the length of the pattern and n is the size of the trie. To demonstrate th...
متن کاملReducing the Space Requirement of LZ-Index
The LZ-index is a compressed full-text self-index able to represent a text T1...u, over an alphabet of size σ = O(polylog(u)) and with k-th order empirical entropy Hk(T ), using 4uHk(T )+ o(u logσ) bits for any k = o(logσ u). It can report all the occ occurrences of a pattern P1...m in T in O(m3 logσ +(m + occ) log u) worst case time. Its main drawback is the factor 4 in its space complexity, w...
متن کامل